String Analysis for Software Verification and Security by Tevfik Bultan Fang Yu Muath Alkhalaf & Abdulbaki Aydin

Author:Tevfik Bultan, Fang Yu, Muath Alkhalaf & Abdulbaki Aydin
Language: eng
Format: epub
Publisher: Springer International Publishing, Cham

We first apply a transformation and add an extra state, s n+1. The resulting automaton is a DFA A′ with λ-transitions from each of the accepting states of A to s n+1 where λ is a new padding symbol that is not in the alphabet of A. Thus, and furthermore . That is, the augmented DFA A′ preserves both the language and count information of A. Recalling the final automaton from Fig. 7.11a, the corresponding augmented DFA is shown in Fig. 7.11b. (Ignore the dashed λ transition for the time being.)

For our example, we show the transition matrix T and its exponentiations T 2 and T 3:

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.